Implementation of directed multigraphs in Java
نویسنده
چکیده
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Copyright 2003 ACM ... 5.00. 2. BASIC STRUCTURE FOR DIRECTED MULTIGRAPHS
منابع مشابه
A Polynomial-time Algorithm for Detecting the Possibility of Braess Paradox in Directed Graphs
Vulnerable graphs are those directed multigraphs that can generate Braess paradox in Traffic Networks. In this paper, we give a graph-theoretic characterisation of vulnerable directed multigraphs; analogous results appeared in the literature only for undirected multigraphs and for a specific family of directed multigraphs. The proof of our characterisation also provides an algorithm that checks...
متن کاملChinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملCounting Bipartite, k-Colored and Directed Acyclic Multi Graphs Through F-nomial coefficients
Abstract F-nomial coefficients encompass among others well-known binomial coefficients or Gaussian coefficients that count subsets of finite set and subspaces of finite vector space respectively. Here, the so called F-cobweb tiling sequences N(α) are considered. For such specific sequences a new interpretation with respect to Kwaśniewski general combinatorial interpretation of F -nomial coeffic...
متن کاملA decomposition of Gallai multigraphs
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi) graph is a simple, complete, edge-colored (multi) graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decompos...
متن کاملOn Multigraph Extremal Problems
1 . Introduction . In this paper we shall consider multigraphs and digraphs (= directed graphs) with bounded multiplicity : an integer r is fixed and we shall assume, that the considered multigraphs or digraphs have no loops, further, if u and v are two vertices of a multigraph M, they can be joined by more than one edge, however, they cannot be joined by more than r edges. In case of digraphs ...
متن کامل